Improved lower bound on superluminal quantum communication

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lower Bound on Entanglement-Assisted Quantum Communication Complexity

We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boo...

متن کامل

Lower Bound on Expected Communication Cost of Quantum Huffman Coding

Data compression is a fundamental problem in quantum and classical information theory. A typical version of the problem is that the sender Alice receives a (classical or quantum) state from some known ensemble and needs to transmit them to the receiver Bob with average error below some specified bound. We consider the case in which the message can have a variable length and the goal is to minim...

متن کامل

On the Possibility of Nonlinear Quantum Evolution and Superluminal Communication

A possible mechanism of nonlinear quantum evolution is introduced and its implications for quantum communication are investigated. First, it is argued that an appropriate combination of wavefunction collapse and the consciousness of observer may permit the observer to distinguish nonorthogonal quantum states in principle, and thus consciousness will introduce certain nonlinearity into quantum d...

متن کامل

Quantum lower bound for sorting ∗

Needless to say, sorting, especially sorting by comparisons, has been a classical problem in computer science. Despite its enormous importance, the complexity, in terms of the number of comparisons needed, is simple to analyze. Straightforward information theoretical argument gives the tight lower bound of log2(n!), which is achieved by several simple sorting algorithms, for example, Insertion ...

متن کامل

Quantum Limitations on Superluminal Propagation

Yakir Aharonov,1 Benni Reznik,2 and Ady Stern3 1School of Physics and Astronomy, Tel Aviv University, Tel Aviv 69978, Israel and Department of Physics, University of South Carolina, Columbia, South Carolina 29208 2Theoretical Division, T-6, MS B288, Los Alamos National Laboratory, Los Alamos, New Mexico 87545 3Department of Condensed Matter Physics, Weizmann Institute of Science, Rehovot 76100,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2018

ISSN: 2469-9926,2469-9934

DOI: 10.1103/physreva.97.052124